//不要给我WA WA 叫
//一定AC
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <iomanip>
#include <climits>
#define int long long 
#define x first 
#define y second 
using namespace std;
const int N = 1e5 + 10;
int a[N];
void solve()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    if(a[1] == a[n]) 
    {
        cout << "draw" << endl;
        return;
    }
    int sum1 = 0;
    int sum2 = 0;
    int h_max = 0;
    int z_min = 0; 
    for(int i = n; i >= 2; i -= 2)  
    {
        sum1 += a[i];
        h_max = max(a[i],h_max);
    }

    for(int i = n - 1; i >= 1; i -= 2) 
    {
       sum2 += a[i];
       z_min = min(a[i],z_min);  
    } 
 //   sum1 += a[1];
 //   sum2 += a[n];
     sum1 = sum1 - h_max + z_min;
     sum2 = sum2 + h_max - z_min;
    if(sum1 > sum2)       cout << "kou" << endl;
    else if(sum1 < sum2)   cout << "yukari" << endl;
    else cout << "draw" << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int t;
    cin >> t;
    while(t -- )  solve();
    return 0;
}
// 2 3 4 2 1 5 -> 1 2 2 3 4 5
// 4 5 5 6 6 6 
